A Proof Dedicated Meta-Language

نویسنده

  • David Delahaye
چکیده

We describe a proof dedicated meta-language, called Ltac, in the context of the Coq proof assistant. This new layer of meta-language is quite appropriate to write small and local automations. Ltac is essentially a small functional core with recursors and powerful pattern-matching operators for Coq terms but also for proof contexts. As Ltac is not complete, we describe an interface between Ltac and the full programmable meta-language of the system (Objective Caml), which is also the implementation language. This interface is based on a quotation system where we can use Ltac’s syntax in ML files, and where it is possible to insert ML code in Ltac scripts by means of antiquotations. In that way, the two meta-languages are not opposed and we give an example where they fairly cooperate. Thus, this shows that a LCF-like system with a two-level meta-language is completely realistic.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Another proof of Banaschewski's surjection theorem

We present a new proof of Banaschewski's theorem stating that the completion lift of a uniform surjection is a surjection. The new procedure allows to extend the fact (and, similarly, the related theorem on closed uniform sublocales of complete uniform frames) to quasi-uniformities ("not necessarily symmetric uniformities"). Further, we show how a (regular) Cauchy point on a closed uniform subl...

متن کامل

Proceedings of the First workshop on Virtual Machines and Intermediate Languages for emerging modularization

Current implementations for aspect-oriented programming languages map the aspect-oriented concepts of source programs to object-oriented bytecode. This hinders execution environments with dedicated support for such concepts in applying their optimizations, as they have to recover the original aspect definition from bytecode. To address this representational gap we propose an architecture for im...

متن کامل

The effects of task complexity on Chinese learners’ language production: A synthesis and meta-analysis

The  present  meta-analysis  was  conducted  to  provide  a  quantitative  measure  of  the overall effects of task complexity on Chinese EFL learners’ language  production.  Based  on  the strict inclusion criteria, 12 primary  studies  were synthesized according to key  features.  Eleven of them  were  meta-analyzed  to  investigate  effects  of  raising  the  resource-directing  task  comple...

متن کامل

Well-Typed Languages are Sound

Type soundness is an important property of modern programming languages. In this paper we explore the idea that well-typed languages are sound : the idea that the appropriate typing discipline over language specifications guarantees that the language is type sound. We instantiate this idea for a certain class of languages defined using small step operational semantics by ensuring the progress a...

متن کامل

A Lesson on Proof of Programs with Frama-C. Invited Tutorial Paper

To help formal verification tools to make their way into industry, they ought to be more widely used in software engineering classes. This tutorial paper serves this purpose and provides a lesson on formal specification and proof of programs with FRAMA-C, an open-source platform dedicated to analysis of C programs, and ACSL, a specification language for C.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 70  شماره 

صفحات  -

تاریخ انتشار 2002